Resource Quantification for the No-Programing Theorem
نویسندگان
چکیده
منابع مشابه
SLWV - A Logic Programing Theorem Prover
The purpose of this work is to define a theorem prover that retains the procedural aspects of logic programing. The proof system we propose (SLWV1 resolution) is defined for a set of clauses in the implicational form (keeping to the form of logic programs), not requiring contrapositives, and has an execution method that respects the execution order of literals in a clause, preserving the proced...
متن کاملResource-Bound Quantification for Graph Transformation
Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an im...
متن کاملClassical no-cloning theorem.
A classical version of the no-cloning theorem is discussed. We show that an arbitrary probability distribution associated with a (source) system cannot be copied onto another (target) system while leaving the original distribution of the source system unperturbed. For classical dynamical systems such a perfect cloning process is not permitted by the Liouvillian (ensemble) evolution associated w...
متن کاملNo Quantum Brooks' Theorem
First, I introduce quantum graph theory. I also discuss a known lower bound on the independence numbers and derive from it an upper bound on the chromatic numbers of quantum graphs. Then, I construct a family of quantum graphs that can be described as tropical, cyclical, and commutative. I also define a step logarithm function and express with it the bounds on quantum graph invariants in closed...
متن کاملGeneralized no-broadcasting theorem.
We prove a generalized version of the no-broadcasting theorem, applicable to essentially any nonclassical finite-dimensional probabilistic model satisfying a no-signaling criterion, including ones with "superquantum" correlations. A strengthened version of the quantum no-broadcasting theorem follows, and its proof is significantly simpler than existing proofs of the no-broadcasting theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2019
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.122.080505